//https://leetcode.cn/problems/climbing-stairs/
package codeRandomThoughts.Test70爬楼梯;

public class Solution {
    //返回爬到n阶有几种方法
    public int climbStairs(int n) {
        if (n == 0) return 0;
        if (n == 1) return 1;
        if (n == 2) return 2;

        //可以爬1阶或者爬2阶
        return climbStairs(n - 1) + climbStairs(n - 2);
    }
}
